A Mazur-Orlicz type theorem for submodular set functions
نویسندگان
چکیده
منابع مشابه
Maximization of Submodular Set Functions
In this technical report, we aim to give a simple yet detailed analysis of several various submodular maximization algorithms. We start from analyzing the classical greedy algorithm, firstly discussed by Nemhauser et al. (1978), that guarantees a tight bound for constrained maximization of monotonically submodular set functions. We then continue by discussing two randomized algorithms proposed ...
متن کاملRough Set Methods and Submodular Functions
In this article we discuss the connection of Rough Set methods and submodular functions. We show that discernibility measure used in reduct calculation is submodular and provides a bridge between certain methods from Rough Set theory and Submodular Function theory.
متن کاملA New Common Fixed Point Theorem for Suzuki Type Contractions via Generalized $Psi$-simulation Functions
In this paper, a new stratification of mappings, which is called $Psi$-simulation functions, is introduced to enhance the study of the Suzuki type weak-contractions. Some well-known results in weak-contractions fixed point theory are generalized by our researches. The methods have been appeared in proving the main results are new and different from the usual methods. Some suitable examples ar...
متن کاملMaximizing General Set Functions by Submodular Decomposition
We present a branch and bound method for maximizing an arbitrary set function V : 2 θ → R . By decomposing θ as f-δ , where f is a submodular function and δ is the cut function of a (simple, undirected) graph G with vertex set V, our original problem is reduced to a sequence of submodular maximization problems. We characterize a class of submodular functions, which when maximized in the subprob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1986
ISSN: 0022-247X
DOI: 10.1016/0022-247x(86)90175-7